The Impact of Encoding and Transport for Massive Real-time IoT Data on Edge Resource Consumption

Edge microservice applications are becoming a viable solution for the execution of real-time IoT analytics, due to their rapid response and reduced latency. With Edge Computing, unlike the central Cloud, the amount of available resource is constrained and the computation that can be undertaken is also limited. Microservices are not standalone, they are devised as a set of cooperating tasks that are fed data over the network through specific APIs. The cost of processing these feeds of data in real-time, especially for massive IoT configurations, is however generally overlooked. In this work we evaluate the cost of dealing with thousands of sensors sending data to the edge with the commonly used encoding of JSON over REST interfaces, and compare this to other mechanisms that use binary encodings as well as streaming interfaces. The choice has a big impact on the microservice implementation, as a wrong selection can lead to excessive resource consumption, because using a less efficient encoding and transport mechanism results in much higher resource requirements, even to do an identical job

End-to-end slices to orchestrate resources and services in the cloud-to-edge continuum

Fog computing, combined with traditional cloud computing, offers an inherently distributed infrastructure – referred to as the cloud-to-edge continuum – that can be used for the execution of low-latency and location-aware IoT services. The management of such an infrastructure is complex: resources in multiple domains need to be accessed by several tenants, while an adequate level of isolation and performance has to be guaranteed. This paper proposes the dynamic allocation of end-to-end slices to perform the orchestration of resources and services in such a scenario. These end-to-end slices require a unified resource management approach that encompasses both data centre and network resources. Currently, fog orchestration is mainly focussed on the management of compute resources, likewise, the slicing domain is specifically centred solely on the creation of isolated network partitions. A unified resource orchestration strategy, able to integrate the selection, configuration and management of compute and network resources, as part of a single abstracted object, is missing. This work aims to minimise the silo-effect, and proposes end-to-end slices as the foundation for the comprehensive orchestration of compute resources, network resources, and services in the cloud-to-edge continuum, as well acting as the basis for a system implementation. The concept of the end-to-end slice is formally described via a graph-based model that allows for dynamic resource discovery, selection and mapping via different algorithms and optimisation goals; and a working system is presented as the way to build slices across multiple domains dynamically, based on that model. These are independently accessible objects that abstract resources of various providers – traded via a Marketplace – with compute slices, allocated using the bare-metal cloud approach, being interconnected to each other via the connectivity of network slices. Experiments, carried out on a real testbed, demonstrate three features of the end-to-end slices: resources can be selected, allocated and controlled in a softwarised fashion; tenants can instantiate distributed IoT services on those resources transparently; the performance of a service is absolutely not affected by the status of other slices that share the same resource infrastructure

Developing and Measuring Parallel Rule-Based Systems in a Functional Programming Environment

This thesis investigates the suitability of using functional programming for building parallel rule-based systems. A functional version of the well known rule-based system OPS5 was implemented, and there is a discussion on the suitability of functional languages for both building compilers and manipulating state. Functional languages can be used to build compilers that reflect the structure of the original grammar of a language and are, therefore, very suitable. Particular attention is paid to the state requirements and the state manipulation structures of applications such as a rule-based system because, traditionally, functional languages have been considered unable to manipulate state. From the implementation work, issues have arisen that are important for functional programming as a whole. They are in the areas of algorithms and data structures and development environments. There is a more general discussion of state and state manipulation in functional programs and how theoretical work, such as monads, can be used. Techniques for how descriptions of graph algorithms may be interpreted more abstractly to build functional graph algorithms are presented. Beyond the scope of programming, there are issues relating both to the functional language interaction with the operating system and to tools, such as debugging and measurement tools, which help programmers write efficient programs. In both of these areas functional systems are lacking. To address the complete lack of measurement tools for functional languages, a profiling technique was designed which can accurately measure the number of calls to a function , the time spent in a function, and the amount of heap space used by a function. From this design, a profiler was developed for higher-order, lazy, functional languages which allows the programmer to measure and verify the behaviour of a program. This profiling technique is designed primarily for application programmers rather than functional language implementors, and the results presented by the profiler directly reflect the lexical scope of the original program rather than some run-time representation. Finally, there is a discussion of generally available techniques for parallelizing functional programs in order that they may execute on a parallel machine. The techniques which are easier for the parallel systems builder to implement are shown to be least suitable for large functional applications. Those techniques that best suit functional programmers are not yet generally available and usable

In-Network Scalable Video Adaption Using Big Packet Protocol

The essence of this work is to show how SVC Scalable Video can be adaptated in the network in an effective way, when the Big Packet Protocol (BPP) is used. This demo shows the advantages of BPP, which is a recently proposed transport protocol devised for realtime applications. We will show that in-network adaption can be provided using this new protocol. We show how a network node can change the packets during their transmission, but still present a very usable video stream to the client. The preliminary results show that BPP is a good alternative transport for video transmission

Microservices and serverless functions – lifecycle, performance, and resource utilisation of edge based real-time IoT analytics

Edge Computing harnesses resources close to the data sources to reduce end-to-end latency and allow real-time process automation for verticals such as Smart City, Healthcare and Industry 4.0. Edge resources are limited when compared to traditional Cloud data centres; hence the choice of proper resource management strategies in this context becomes paramount. Microservice and Function as a Service architectures support modular and agile patterns, compared to a monolithic design, through lightweight containerisation, continuous integration / deployment and scaling. The advantages brought about by these technologies may initially seem obvious, but we argue that their usage at the Edge deserves a more in-depth evaluation. By analysing both the software development and deployment lifecycle, along with performance and resource utilisation, this paper explores microservices and two alternative types of serverless functions to build edge real-time IoT analytics. In the experiments comparing these technologies, microservices generally exhibit slightly better end-to-end processing latency and resource utilisation than serverless functions. One of the serverless functions and the microservices excel at handling larger data streams with auto-scaling. Whilst serverless functions natively offer this feature, the choice of container orchestration framework may determine its availability for microservices. The other serverless function, while supporting a simpler lifecycle, is more suitable for low-invocation scenarios and faces challenges with parallel requests and inherent overhead, making it less suitable for real-time processing in demanding IoT settings

A Multi-Institutional Study on the Safety and Efficacy of Specimen Morcellation After Laparoscopic Radical Nephrectomy for Clinical Stage T1 or T2 Renal Cell Carcinoma

Abstract Introduction and Objective: Specimen morcellation during laparoscopic radical nephrectomy (LRN) for renal cell carcinoma (RCC) is controversial. We seek to evaluate the safety and efficacy of specimen morcellation and LRN for treatment of presumed malignant renal lesions. Methods: We retrospectively reviewed all patients who underwent LRN at three academic institutions from 1996 to 2007. One hundred eighty-eight patients underwent specimen morcellation after LRN for enhancing solid or cystic renal masses. Results: LRN was successfully performed on all the patients. Patient age ranged from 36 to 94. One hundred sixty-seven patients were in clinical stage T1, 19 patients T2, and unknown in two. The specimen was manually morcellated within a Cook Lap Sac or Endocatch II bag under laparoscopic or direct observation. On histological review of morcellated specimens, 165 patients were confirmed to have RCC, 17 had an oncocytoma, and 2 had benign cysts. At least 13 patients with RCC were pathologically upgraded to stage T3. Mean operative time was 225 minutes (range 94-650). Mean hospital stay was 2.5 days (range 1-8). In patients with RCC, 11 developed recurrent disease with mean follow-up of 21 months (range 0.3-111). In one patient, a port site recurrence occurred in concert with renal fossa and lymph node metastases. Conclusions: Intracorporeal mechanical morcellation after LRN appears to be safe and effective in clinical stage T1 and T2 RCC. This supports the use of morcellation as an alternative for intact specimen removal in properly selected patients.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/78157/1/end.2009.0387.pd

Manageability of Future Internet Virtual Networks from a Practical Viewpoint

International audienceThe Autonomic Internet project approach relies on abstractions and distributed systems of a five plane solution for the provision of Future Internet Services (OSKMV): Orchestration, Service Enablers, Knowledge, Management and Virtualisation Planes. This paper presents a practical viewpoint of the manageability of virtual networks, exercising the components and systems that integrate this approach and that are being validated. This paper positions the distributed systems and networking services that integrate this solution, focusing on the provision of Future Internet services for self-configuration and self- performance management scenes

Clinical, Pathologic, and Functional Outcomes After Nephron-Sparing Surgery in Patients with a Solitary Kidney: A Multicenter Experience

Abstract Background and Purpose: Surgical management of a renal neoplasm in a solitary kidney is a balance between oncologic control and preservation of renal function. We analyzed patients with a renal mass in a solitary kidney undergoing nephron-sparing procedures to determine perioperative, oncologic, and renal functional outcomes. Patients and Methods: A multicenter study was performed from 12 institutions. All patients with a functional or anatomic solitary kidney who underwent nephron-sparing surgery for one or more renal masses were included. Tumor size, complications, and recurrence rates were recorded. Renal function was assessed with serum creatinine level and estimated glomerular filtration rate. Results: Ninety-eight patients underwent 105 ablations, and 100 patients underwent partial nephrectomy (PN). Preoperative estimated glomerular filtration rate (eGFR) was similar between the groups. Tumors managed with PN were significantly larger than those managed with ablation (P<0.001). Ablations were associated with a lower overall complication rate (9.5% vs 24%, P=0.01) and higher local recurrence rate (6.7% vs 3%, P=0.04). Eighty-four patients had a preoperative eGFR ≥60?mL/min/1.73?m2. Among these patients, 19 (23%) fell below this threshold after 3 months and 15 (18%) at 12 months. Postoperatively, there was no significant difference in eGFR between the groups. Conclusions: Extirpation and ablation are both reasonable options for treatment. Ablation is more minimally invasive, albeit with higher recurrence rates compared with PN. Postoperative renal function is similar in both groups and is not affected by surgical approach.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/98449/1/end%2E2012%2E0114.pd

Genome-wide Analyses Identify KIF5A as a Novel ALS Gene

To identify novel genes associated with ALS, we undertook two lines of investigation. We carried out a genome-wide association study comparing 20,806 ALS cases and 59,804 controls. Independently, we performed a rare variant burden analysis comparing 1,138 index familial ALS cases and 19,494 controls. Through both approaches, we identified kinesin family member 5A (KIF5A) as a novel gene associated with ALS. Interestingly, mutations predominantly in the N-terminal motor domain of KIF5A are causative for two neurodegenerative diseases: hereditary spastic paraplegia (SPG10) and Charcot-Marie-Tooth type 2 (CMT2). In contrast, ALS-associated mutations are primarily located at the C-terminal cargo-binding tail domain and patients harboring loss-of-function mutations displayed an extended survival relative to typical ALS cases. Taken together, these results broaden the phenotype spectrum resulting from mutations in KIF5A and strengthen the role of cytoskeletal defects in the pathogenesis of ALS.Peer reviewe

The Effects of Packet Wash on SVC Video in Limited Bandwidth Environments

IEEE 23rd International Conference on High Performance Switching and Routing (IEEE HPSR) -- JUN 06-08, 2022 -- Taicang, PEOPLES R CHINAThis paper describes the effects of the Packet Wash process on the transmission of layered SVC video streams. We show how the packet size is adapted when using a number of different packing strategies, that map the video data into the BPP packets, and discuss the relationship between the packing strategies on the sender side and the chunk removal in the washing process. We demonstrate how the packing strategy causes different impacts on the number of and the sizes of the washed chunks. As the bandwidth reduces, more of the chunks in a packet get washed away. Although the receiver gets packets that are much smaller than those transmitted by the sender, it is still able to play video with a high QoE as zero packets are dropped. This traffic engineering enables a direct implementation of an in-network video adaption scheme. The experimental evaluation highlights that the effects of Packet Wash become more obvious in environments where there is limited bandwidth.IEEE,IEEE Commun SocHuawei Technologies Co., Ltd. - TUBITAK Electric, Electronic and Informatics Research Group (EEEAG) [121E373]Dr S. Clayman is partially supported by Huawei Technologies Co., Ltd. -Dr M Sayit's work is funded by TUBITAK Electric, Electronic and Informatics Research Group (EEEAG) under grant 121E373